A DNA-Based Simulation Model for Bounded Fan-in Boolean Circuits
نویسندگان
چکیده
DNA computing has recently gained intensive attention as an emerging field bridging the gap between computer science and biomolecular science. DNA based computing can be competitively used to simulate various computing models including Boolean circuits because of its potential to offer massive parallelism. In this paper we present a new DNA-based evaluation algorithm for a bounded fan-in circuit consisting of AND and OR gates. The proposed model employs standard bio-molecular techniques. The main advantage of our method is that each level of circuit is capable of containing both AND and OR gates. It is shown that large bounded fan-in circuits can be simulated by the proposed approach with a logarithmic slowdown in computation time. Key-Words: DNA computing, Boolean circuit, parallel processing, simulation, molecular programming
منابع مشابه
DNA-Based Self-Propagating Algorithm for Solving Bounded-Fan-In Boolean Circuits
This paper proposes a method for simulating Boolean circuits based on primer extension and DNA cleavage. The advantage of the current method is the requirement of little human intervention during the course of simulation. The paper also explores the potential of RecA-assisted DNA-DNA hybridization in DNA-based computation. The method could in principle allow simulation of many levels of large B...
متن کاملA New Circuit Scheme for Wide Dynamic Circuits
In this paper, a new circuit scheme is proposed to reduce the power consumption of dynamic circuits. In the proposed circuit, an NMOS keeper transistor is used to maintain the voltage level in the output node against charge sharing, leakage current and noise sources. Using the proposed keeper scheme, the voltage swing on the dynamic node is lowered to reduce the power consumption of wide fan-in...
متن کاملOn the Computation of Boolean Functions by Analog Circuits of Bounded Fan-in (Extended Abstract)
W e consider the complexity of computing Boolean functions b y analog circuits of bounded fan-in, i.e. b y circuits of gates computing real-valued functions, either exactly or as a sign-representation. Sharp upper bounds are obtained for the complexity of the most &@cult n-variable function over certain bases (signrepresentation by arithmetic circuits and exact computation b y piecewise linear ...
متن کاملOn the philosophical basis of computational theories
In this short note we exemplify the problems that may arise when presenting computational theories based on theories of natural phenomena that lack computational complexity components. These problems may arise when the latter theories refers to environments of unbounded size. In contrast, the standard theory of computation (e.g., based on the model of Turing machines) refer implicitly to theori...
متن کاملOn the Computation of Boolean Functions by Analog Circuits of Bounded Fan-In
We consider the complexity of computing Boolean functions by analog circuits of bounded fan-in, i.e., by circuits of gates computing real-valued functions, either exactly or as sign-representation. Sharp upper bounds are obtained for the complexity of the most difficult n-variable function over certain bases (sign-representation by arithmetic circuits and exact computation by piecewise linear c...
متن کامل